Cacti, Braids and Complex Polynomials
نویسندگان
چکیده
The study of the topological classiication of complex polynomials began in the XIX-th century by Luroth (1871), Clebsch (1873) and Hurwitz (1891). In the works of Zdravkovska 23] and Khovanskii and Zdravkovska 17] the problem is reduced to a purely combinatorial one, that of the study of a certain action of the braid groups on a class of tree-like gures that we, following 14], call \cacti". Using explicit computation of the braid group orbits, enumerative results of 14], and also establishing some combinatorial invariants of the action, we provide the topological classiication of polynomials of degree up to 9 (previous results were known up to degree 6). R esum e L' etude de la classiication topologique des polyn^ omes complexes a commenc e au XIX-eme siecle par Luroth (1871), Clebsch (1873) et Hurwitz (1891). Dans les travaux de Zdravkovska 23] et Khovanskii et Zdravkovska 17] le probl eme est r eduit a une etude purement com-binatoire d'une certaine action du groupe des tresses sur un genre de gures arborescentes que nous appelons, d'apr es 14], les \cactus". En utilisant le calcul explicite des orbites du groupe des tresses, les r esultats enum eratifs de 14], et aussi en mettant en evidence certains invariants combinatoires de l'action, nous achevons la classiication topologique des polyn^ omes de degr e jusqu'' a 9 (une telle classiication a et e connue jusqu'au degr e 6).
منابع مشابه
Exact dimer statistics and characteristic polynomials of cacti lattices
The pruning method developed earlier by one of the authors (K.B.) combined with the operator method is shown to yield powerful recursive relations for generating functions for dimer statistics and characteristic polynomials of cacti graphs and cacti lattices. The method developed is applied to linear cacti, Bethe cacti of any length containing rings of any size, and cyclic cacti of any length a...
متن کاملEnumeration of M-ary Cacti
The purpose of this paper is to enumerate various classes of cyclically colored m-gonal plane cacti, called m-ary cacti. This combinatorial problem is motivated by the topological classiication of complex polynomials having at most m critical values, studied by Zvonkin and others. We obtain explicit formulae for both labelled and unlabelled m-ary cacti, according to i) the number of polygons, i...
متن کاملEnumeration of m-ary cacti according to their color and degree distributions
We enumerate cyclically colored m-gonal plane cacti (called m-ary cacti) according to the degree distribution of vertices of each color. This combinatorial problem is motivated by the topological classification of complex polynomials having at most m critical values, studied by Zvonkin and others. The corresponding problem for rooted m-ary cacti has been solved by Goulden and Jackson in connect...
متن کاملOn chromaticity of graphs
Abstract In this paper we obtain the explicit formulas for chromatic polynomials of cacti. From the results relating to cacti we deduce the analogous formulas for the chromatic polynomials of n–gon–trees. Besides, we characterize unicyclic graphs by their chromatic polynomials. We also show that the so–called clique–forest–like graphs are chromatically equivalent.
متن کاملOrbits of Braid Groups on Cacti
One of the consequences of the classification of finite simple groups is the fact that non-rigid polynomials (those with more than two finite critical values), considered as branched coverings of the sphere, have exactly three exceptional monodromy groups (one in degree 7, one in degree 13 and one in degree 15). By exceptional here we mean primitive and not equal to Sn or An, where n is the deg...
متن کامل